Matching Extension Missing Vertices and Edges in Triangulations of Surfaces
نویسندگان
چکیده
Let G be a 5-connected triangulation of a surface Σ different from the sphere, and let χ = χ(Σ) be the Euler characteristic of Σ. Suppose that V0 ⊆ V (G) with |V (G) − V0| even and M and N are two matchings in G − V0 of sizes m and n respectively such that M ∩ N = ∅. It is shown that if the pairwise distance between any two elements of V0 ∪ M ∪ N is at least 5 and the face-width of the embedding of G in Σ is at least max{20m− 8χ− 23, 6}, then there is a perfect matching M0 in G−V0 containing M such that M0 ∩N = ∅.
منابع مشابه
Extension to Even Triangulations
Extension of a graph G is to construct a new graph with certain properties by adding edges to some pairs of vertices in G. In this paper, we focus on extension of a quadrangulation of a surface to even triangulations, where a quadrangulation is a map on a surface with every face quadrangular and a triangulation is even if all the vertices have even degree. Zhang and He [SIAM J. Comput. 34 (2005...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملManaging Adjacency in Triangular Meshes
The problem of efficiently accessing and maintaining adjacency information for triangulations over general surface domains is addressed. Rapid access to adjacent vertices, edges, and triangles is an important aspect of multiresolution techniques, from subdivision surfaces to mesh simplification. Novel data structures and algorithms for the construction, manipulation, and traversal of triangulat...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملEdge Proximity Conditions for Extendability in Planar Triangulations
A graph G with at least 2m + 2 vertices is said to be distance d m-extendable if for any matching M of G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching of G containing M . In this paper we prove that every 5-connected triangulation on the plane of even order is distance 3 9-extendable and distance 4 m-extendable for any m.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 85 شماره
صفحات -
تاریخ انتشار 2017